See cop number in All languages combined, or Wiktionary
{
"forms": [
{
"form": "cop numbers",
"tags": [
"plural"
]
}
],
"head_templates": [
{
"args": {},
"expansion": "cop number (plural cop numbers)",
"name": "en-noun"
}
],
"lang": "English",
"lang_code": "en",
"pos": "noun",
"senses": [
{
"categories": [
{
"kind": "other",
"name": "English entries with incorrect language header",
"parents": [
"Entries with incorrect language header",
"Entry maintenance"
],
"source": "w"
},
{
"kind": "other",
"name": "Pages with 1 entry",
"parents": [],
"source": "w"
},
{
"kind": "other",
"name": "Pages with entries",
"parents": [],
"source": "w"
},
{
"kind": "topical",
"langcode": "en",
"name": "Graph theory",
"orig": "en:Graph theory",
"parents": [
"Mathematics",
"Visualization",
"Formal sciences",
"Computing",
"Interdisciplinary fields",
"Sciences",
"Technology",
"All topics",
"Fundamental"
],
"source": "w"
}
],
"glosses": [
"For a given undirected graph, the minimum number of cops that suffices to ensure a win (i.e. a capture of the robber) in a certain pursuit–evasion game on the graph."
],
"id": "en-cop_number-en-noun-~bC3iVKG",
"links": [
[
"graph theory",
"graph theory"
],
[
"undirected graph",
"undirected graph"
],
[
"minimum",
"minimum"
],
[
"pursuit",
"pursuit"
],
[
"evasion",
"evasion"
],
[
"game",
"game"
]
],
"raw_glosses": [
"(graph theory) For a given undirected graph, the minimum number of cops that suffices to ensure a win (i.e. a capture of the robber) in a certain pursuit–evasion game on the graph."
],
"synonyms": [
{
"word": "copnumber"
}
],
"topics": [
"graph-theory",
"mathematics",
"sciences"
]
}
],
"word": "cop number"
}
{
"forms": [
{
"form": "cop numbers",
"tags": [
"plural"
]
}
],
"head_templates": [
{
"args": {},
"expansion": "cop number (plural cop numbers)",
"name": "en-noun"
}
],
"lang": "English",
"lang_code": "en",
"pos": "noun",
"senses": [
{
"categories": [
"English countable nouns",
"English entries with incorrect language header",
"English lemmas",
"English multiword terms",
"English nouns",
"Pages with 1 entry",
"Pages with entries",
"en:Graph theory"
],
"glosses": [
"For a given undirected graph, the minimum number of cops that suffices to ensure a win (i.e. a capture of the robber) in a certain pursuit–evasion game on the graph."
],
"links": [
[
"graph theory",
"graph theory"
],
[
"undirected graph",
"undirected graph"
],
[
"minimum",
"minimum"
],
[
"pursuit",
"pursuit"
],
[
"evasion",
"evasion"
],
[
"game",
"game"
]
],
"raw_glosses": [
"(graph theory) For a given undirected graph, the minimum number of cops that suffices to ensure a win (i.e. a capture of the robber) in a certain pursuit–evasion game on the graph."
],
"topics": [
"graph-theory",
"mathematics",
"sciences"
]
}
],
"synonyms": [
{
"word": "copnumber"
}
],
"word": "cop number"
}
Download raw JSONL data for cop number meaning in English (1.1kB)
This page is a part of the kaikki.org machine-readable English dictionary. This dictionary is based on structured data extracted on 2024-12-15 from the enwiktionary dump dated 2024-12-04 using wiktextract (8a39820 and 4401a4c). The data shown on this site has been post-processed and various details (e.g., extra categories) removed, some information disambiguated, and additional data merged from other sources. See the raw data download page for the unprocessed wiktextract data.
If you use this data in academic research, please cite Tatu Ylonen: Wiktextract: Wiktionary as Machine-Readable Structured Data, Proceedings of the 13th Conference on Language Resources and Evaluation (LREC), pp. 1317-1325, Marseille, 20-25 June 2022. Linking to the relevant page(s) under https://kaikki.org would also be greatly appreciated.